Optimality: from neural networks to universal grammar.

نویسندگان

  • A Prince
  • P Smolensky
چکیده

Can concepts from the theory of neural computation contribute to formal theories of the mind? Recent research has explored the implications of one principle of neural computation, optimization, for the theory of grammar. Optimization over symbolic linguistic structures provides the core of a new grammatical architecture, optimality theory. The proposition that grammaticality equals optimality sheds light on a wide range of phenomena, from the gulf between production and comprehension in child language, to language learnability, to the fundamental questions of linguistic theory: What is it that the grammars of all languages share, and how may they differ?

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?

  Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...

متن کامل

Optimality Theory: Universal Grammar, Learning and Parsing Algorithms, and Connectionist Foundations (Abstract)

We present a recently proposed theory of grammar, Optimality Theory (OT; Prince & Smolensky 1991, 1993). The principles of OT derive in large part from the high-level principles governing computation in connectionist networks. The talk proceeds as follows: (1) we summarize OT and its applications to UG. The we present (2) learning and (3) parsing algorithms for OT. Finally, (4) we show how cruc...

متن کامل

On Eco-Grammar Systems and Artificial Neural Networks

Eco-grammar systems and artiicial neural networks have many common features: massive parallelism, independently working elements (agents/neurons), cooperation of the elements and, not least, universal computational power (at least as that of Turing Machine). We prove the possibility to simulate each step of the one type system by the xed number of steps of the another type one without loss of t...

متن کامل

Relationship between Iranian EFL High School Students’ Knowledge of Universal Grammar and their Performance on Standardized General English Proficiency Tests

This study investigated the relationship between Iranian high school students’ Universal Grammar knowledge and their performance on such standardized general English proficiency tests as PET and FCE internationally administered by Cambridge University. To this end, 108 students were randomly chosen from some high schools located in Malayer from Hamedan. Since this study was correlational in nat...

متن کامل

The Learnability of Optimality Theory: An Algorithm and Some Basic Complexity Results

If Optimality Theory (Prince & Smolensky 1991, 1993) is correct, Universal Grammar provides a set of universal constraints which are highly general, inherently conflicting, and consequently rampantly violated in the surface forms of languages. A language’s grammar ranks the universal constraints in a dominance hierarchy, higher-ranked constraints taking absolute priority over lower-ranked const...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Science

دوره 275 5306  شماره 

صفحات  -

تاریخ انتشار 1997